Higher-Order Computational Logic
نویسنده
چکیده
This paper presents the case for the use of higher-order logic as a foundation for computational logic. A suitable polymorphicallytyped, higher-order logic is introduced and its syntax and proof theory briefly described. In addition, a metric space of closed terms suitable for knowledge representation purposes is presented. The approach to representing individuals is illustrated with some examples, as is the technique of programming with abstractions. The paper concludes by placing the results in the wider context of previous and current research in the use of higher-order logic in computational logic.
منابع مشابه
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, it is shown that the similarity between learning in higher-order logic and traditional attributevalue learning allows many results from computational learning theory to be ‘ported’ to the logical setting with ease. As ...
متن کاملA Higher-Order Computational Model for Cooperative Constraint Programming
This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on λ-abstractions, using the instance CFLP(C) of the generic Constraint Functional Logic Programming (CFLP ) scheme [7] over a so-called higher-order coordination domain C. We provide this framework as a powerful co...
متن کاملComputational Logic: Memories of the Past and Challenges for the Future
The development of computational logic since the introduction of Frege’s modern logic in 1879 is presented in some detail. The rapid growth of the field and its proliferation into a wide variety of subfields is noted and is attributed to a proliferation of subject matter rather than to a proliferation of logic itself. Logic is stable and universal, and is identified with classical first order l...
متن کاملLogic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been implemented within the proof planning system λClam . The generality of the approach is such that its extension to allow synthesis of higher-order logic programs was straightforward. Some illustrative examples are given....
متن کاملSome Uses of Higher - Order Logicin Computational
Consideration of the question of meaning in the framework of linguistics often requires an allusion to sets and other higher-order notions. The traditional approach to representing and reasoning about meaning in a computational setting has been to use knowledge representation systems that are either based on rst-order logic or that use mechanisms whose formal justiications are to be provided af...
متن کامل